Solving matrix polynomial equations arising in queueing problems

Matrix equations arising in regulator problems

The two coupled linear equations C*X-Z%B = A^ C^Y+Z^A^B^ in polynomial matrices are studied in detail. These equations are crucial in the theory and design of linear optimal dynamic regulators via frequency-domain methods. The solvability of these equations is established under natural conditions. All solutions are characterized and then a specific solution is studied. Relation to other matrix ...

Solving polynomial equations for minimal problems in computer vision

Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems, i.e. they can be solved from a minimal number of image points. Finding the solution leads to solving systems of algebraic equations. Often, these systems are not trivial and therefore special algorithms have to be designed to achieve numerical robustness and computational ef...

Solving Polynomial Equations

Solving Monotone Polynomial Equations

We survey some recent results on iterative methods for approximating the least solution of a system of monotone fixed-point polynomial equations.

Haar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems

‎In this paper‎, ‎Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems‎. ‎Firstly‎, ‎using necessary conditions for optimality‎, ‎the problem is changed into a two-boundary value problem (TBVP)‎. ‎Next‎, ‎Haar wavelets are applied for converting the TBVP‎, ‎as a system of differential equations‎, ‎in to a system of matrix algebraic equations‎...